class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        int n = nums.size();
        vector<int> f(n,1);
        vector<int> g(n,1);
        int ret=1;
        for(int i=1;i<n;i++)
        {
        
            for(int j=0;j<i;j++)
            {
                if(nums[i]>nums[j])
                    f[i] = max(g[j]+1,f[i]);
                else if(nums[i]<nums[j])
                {
                    g[i] = max(f[j]+1,g[i]);
                }
            }
            ret = max(ret,max(g[i],f[i]));
        }
        return ret;
    }
};